Complexity Theory for Simpletons

In this article, we shall describe some of the most interesting topics in the subject of Complexity Theory for a general audience. Anyone with a solid foundation in high school mathematics (with some calculus) and an elementary understanding of computer programming will be able to follow this article. First, we shall describe the P versus NP problem and its significance. Next, we shall describe two other famous mathematics problems, the Collatz 3n + 1 Conjecture and the Riemann Hypothesis, and show how the notion of “computational irreducibility” is important for understanding why no one has, as of yet, solved these two problems. Disclaimer: This article was authored by Craig Alan Feinstein in his private capacity. No official support or endorsement by the U.S. Government is intended or should be inferred.